On the spectral radius of weighted trees with fixed diameter and weight set

The p-Laplacian spectral radius of weighted trees with a degree sequence and a weight set

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

Ela the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

Ela Distance Spectral Radius of Trees with Fixed Maximum Degree∗

Abstract. Distance energy is a newly introduced molecular graph-based analog of the total π-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix. For trees and unicyclic graphs, distance energy is equal to the doubled value of the distance spectral radius. In this paper, we introduce a general transformation that increases the distance spect...

Distance spectral radius of trees with fixed maximum degree

On the spectral radius of bipartite graphs with given diameter

Article history: Received 17 March 2008 Accepted 9 October 2008 Available online 3 December 2008 Submitted by R.A. Brualdi AMS classification: 05C50